Why Simpler Arguments are Better
نویسندگان
چکیده
منابع مشابه
Affine Transformations in Speaker Adaptation – Why Simpler Is Better
Speaker adaptation is an important technique that can compensate for the mismatch between training data and the vocal characteristics of an individual user in a speech recognition system, however this can come at the cost of increased computational complexity. This paper reports a detailed comparison of four different affine transformation configurations for speaker adaptation, and the evaluati...
متن کاملApplying Occam's razor to paper (and rock and scissors, too): Why simpler models are sometimes better
A commonly held idea is that people engaged in guessing tasks try to detect sequential dependencies between the occurring events and behave accordingly. For instance, previous accounts of the popular Rock Paper Scissors game assume that people try to anticipate the move an opponent is likely to make and play a move capable of beating it. In the paper we propose that players modulate their behav...
متن کاملThe Simpler the Better
We built three different AI models to predict the category (frozen, liquid or none) based on polarimetric radar variables. One model was a long-shot model for the purpose of winning the competition (it didn’t). The second was a complex black box model to represent the average learnability of the dataset. The third was a simple, human-readable model that would perform similarly to the above two ...
متن کاملReal Arguments Are Approximate Arguments
There are a number of frameworks for modelling argumentation in logic. They incorporate a formal representation of individual arguments and techniques for comparing conflicting arguments. A common assumption for logic-based argumentation is that an argument is a pair 〈Φ, α〉 where Φ is minimal subset of the knowledgebase such that Φ is consistent and Φ entails the claim α. However, real argument...
متن کاملDegree Four Plane Spanners: Simpler and Better
Let P be a set of n points embedded in the plane, and let C be the complete Euclidean graph whose point-set is P. Each edge in C between two points p, q is realized as the line segment [pq], and is assigned a weight equal to the Euclidean distance |pq|. In this paper, we show how to construct inO(n lgn) time a plane spanner of C of maximum degree at most 4 and of stretch factor at most 20. This...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Argumentation
سال: 2015
ISSN: 0920-427X,1572-8374
DOI: 10.1007/s10503-015-9367-1